Generating quasi-random sequences from semi-random sources
نویسندگان
چکیده
منابع مشابه
An Improved Method to Extract Quasi-Random Sequences from Generalized Semi-Random Sources
In this paper, we consider new and general models for imperfect sources of randomness, and show how to obtain quasi-random sequences from such sources. Intuitively, quasi-random sequences are sequences of almost unbiased elements over a finite set. Our model is as follows: Let A be a finite set whose number of elements is a power of 2. Let 1/|A| ≤ δ < 1 be a constant. The source outputs an elem...
متن کاملGenerating Random Sequences from Fingerprints
Biometrics are traditionally employed in user authentication and authorization mechanisms. The vast majority of research effort focuses on applications of biometrics in authentication, aiming to replace passwords as the access control mechanism for cryptographic keys in one way or another. However, the inherent variability in biometrics presents a readily available source of randomness, which, ...
متن کاملGenerating Quasi-Random Paths for Stochastic Processes
The need to numerically simulate stochastic processes arises in many elds. Frequently this is done by discretizing the process into small time steps and applying pseudo-random sequences to simulate the randomness. This paper address the question of how to use quasi-Monte Carlo methods to improve this simulation. Special techniques must be applied to avoid the problem of high dimensionality whic...
متن کاملQuasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of necessity possess them all. These properties, termed quasirandom, have been described for a variety of structures such as graphs, hypergraphs, tournaments, Boolean functions, and subsets of Zn, and most recently, sparse gra...
متن کاملQuasi-Random Sequences and Their Discrepancies
Quasi-random (also called low discrepancy) sequences are a deterministic alternative to random sequences for use in Monte Carlo methods, such as integration and particle simulations of transport processes. The error in uniformity for such a sequence of N points in the s-dimensional unit cube is measured by its discrepancy, which is of size (log N) N-Ifor large N, as opposed to discrepancy of si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1986
ISSN: 0022-0000
DOI: 10.1016/0022-0000(86)90044-9